Dynamic Memory Allocator for Sensor Operating System Design and Analysis

نویسندگان

  • Hong Min
  • Yookun Cho
  • Jiman Hong
چکیده

Dynamic memory allocation is an important mechanism used in operating systems. An efficient dynamic memory allocator can improve the performance of operating systems. In wireless sensor networks, sensor nodes have miniature computing device, small memory space and very limited battery power. Therefore, it is important that sensor operating systems operate efficiently in terms of energy consumption and resource management. And the role of dynamic memory allocator in sensor operating system is more important than one of general operating system. In this paper, we propose a new dynamic memory allocation scheme that resolves the existing problems in dynamic memory allocators. We implemented our scheme on Nano-Qplus which is a sensor operating system based on multi-threading. Our experimental results and static analysis result show our scheme performs efficiently in terms of the execution time and the memory space compared with existing memory allocation mechanisms.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A tunable hybrid memory allocator q Yusuf

Dynamic memory management can make up to 60% of total program execution time. Object oriented languages such as C++ can use 20 times more memory than procedural languages like C. Bad memory management causes severe waste of memory, several times that actually needed, in programs. It can also cause degradation in performance. Many widely used allocators waste memory and/or CPU time. Since comput...

متن کامل

Node-oriented dynamic memory management for real-time systems on ccNUMA architecture systems

Since the 1960s, most operating systems and programming languages have been able to use dynamic memory allocation and deallocation. Although memory allocation has always required explicit interaction with an allocator, deallocation can be either explicit or implicit. Surprisingly, even though memory allocation/deallocation algorithms have been studied extensively over the last five decades, lim...

متن کامل

The Repeat Offender Problem: A Mechanism for Supporting Dynamic-Sized, Lock-Free Data Structures

We define the Repeat Offender Problem (ROP). Elsewhere, we have presented the first dynamic-sized, lock-free data structures that can free memory to any standard memory allocator—even after thread failures—without requiring special support from the operating system, the memory allocator, or the hardware. These results depend on a solution to the ROP problem. Here we present the first solution t...

متن کامل

The Slab Allocator: An Object-Caching Kernel Memory Allocator

This paper presents a comprehensive design overview of the SunOS 5.4 kernel memory allocator. This allocator is based on a set of object-caching primitives that reduce the cost of allocating complex objects by retaining their state between uses. These same primitives prove equally effective for managing stateless memory (e.g. data pages and temporary buffers) because they are space-efficient an...

متن کامل

Open Source Memory Allocators on HP-UX

A number of Open Source Memory Allocators are available today. Each of these allocators uses a different approach to memory management and the effectiveness of each algorithm depends on the particular requirements of the application. Our main aim is to make the well known Open Source memory allocators available on HP-UX, thus providing the customer with a range of allocators to choose from for ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • J. Inf. Sci. Eng.

دوره 26  شماره 

صفحات  -

تاریخ انتشار 2010